Yet Another Look at the Steepest Descent Path

نویسنده

  • Roberto Olender
چکیده

Path integral formulation of Brownian trajectories is employed to re-derive the steepest descent path (SDP). An analogy between the mechanics of overdamped tra-jectories and a Hamiltonian system is found and exploited. The SDP is a special path selected from the curves that connect two predetermined xed conngurations. One xed connguration is the reactant and the second is the product. It is the path that minimizes a functional that we call the \scalar work". The minimum of the scalar work between two stationary points of the potential energy surface is the absolute value of the usual mechanical work. A new numerical algorithm to calculate steepest descent paths is proposed and a computational example is provided. In the new formulation the coordinates of the reactants and the products are the input required to determine the path. This is in contrast to the usual deenition of the SDP that relies on the intermediate saddle point. The diierent input is more convenient for computations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

Steepest Descent Path Study of Electron-Transfer Reactions†

A nonadiabatic steepest descent path method is developed as a qualitative tool to analyze and characterize three different kinetic regimes of electron transfer. In this approach, Miller’s semiclassical instanton solution and Pechukas’ self-consistent treatment of nonadiabatic coupling are applied to the path integral representation of the two-state diffusion equation. The resulting steepest des...

متن کامل

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations

Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

متن کامل

A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations

In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007